Finding All Pure-Strategy Equilibria in Games with Continuous Strategies

نویسندگان

  • Kenneth L. JUDD
  • Philipp RENNER
  • Karl SCHMEDDERS
  • Kenneth L. Judd
  • Philipp Renner
  • Paul Grieco
  • Felix Kubler
  • Andrew McLennan
چکیده

Static and dynamic games are important tools for the analysis of strategic interactions among economic agents and have found many applications in economics. In many games equilibria can be described as solutions of polynomial equations. In this paper we describe state-of-the-art techniques for finding all solutions of polynomial systems of equations and illustrate these techniques by computing all equilibria of both static and dynamic games with continuous strategies. We compute the equilibrium manifold for a Bertrand pricing game in which the number of equilibria changes with the market size. Moreover, we apply these techniques to two stochastic dynamic games of industry competition and check for equilibrium uniqueness.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Finding Equilibria in Games of No Chance

We consider finding maximin strategies and equilibria of explicitly given extensive form games with imperfect information but with no moves of chance. We show: 1. A maximin pure strategy for a two-player extensive form game with perfect recall and no moves of chance can be found in time linear in the size of the game tree. In contrast, it is known that this problem is NP-hard for games with cha...

متن کامل

More strategies, more Nash equilibria

This short paper isolates a non-trivial class of games for which there exists a monotone relation between the size of pure strategy spaces and the number of pure Nash equilibria (Theorem). This class is that of two-player nice games, i.e., games with compact real intervals as strategy spaces and continuous and strictly quasi-concave payoff functions, assumptions met by many economic models. We ...

متن کامل

Notes on Equilibria in Symmetric Games

In a symmetric game, every player is identical with respect to the game rules. We show that a symmetric 2strategy game must have a pure-strategy Nash equilibrium. We also discuss Nash’s original paper and its generalized notion of symmetry in games. As a special case of Nash’s theorem, any finite symmetric game has a symmetric Nash equilibrium. Furthermore, symmetric infinite games with compact...

متن کامل

How to Play 3x3-Games A Strategy Method Experiment

We report an experiment that uses the strategy method (Selten 1967) to elicit subjects' general strategy for playing any 2-person 3x3-game with integer payoffs between 0 and 99. Each two subjects' strategies play 500000 games in each of the 5 tournaments. For games with pure strategy equilibria (ca. 80%), the frequency of pure strategy equilibrium play increases from 51% in the first to 74% in ...

متن کامل

Finding all equilibria in games of strategic complements

I present a simple and fast algorithm that finds all the purestrategy Nash equilibria in games with strategic complementarities. This is the first non-trivial algorithm for finding all pure-strategy Nash equilibria.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012